Graph connectivity - PDFSEARCH.IO - Document Search Engine

Graph connectivity
Results: 1040

#	Item
301	Remarks on bootstrap percolation in metric networks Add to Reading List Source URL: www.weizmann.ac.il Language: English - Date: 2009-05-05 22:21:12 Degree distribution Topology Connectivity Scale-free network Networks Regular graph Degeneracy Erdős–Rényi model Complex network zeta function Graph theory Network theory Random graph
302	I:/Documents and Settings/Jiang/My Documents/rochester/isc/paper/sk-isc-final.dvi Add to Reading List Source URL: discovery.csc.ncsu.edu Language: English - Date: 2011-11-09 13:26:10 Connectivity Connected component Directed graph Graph Graph theory Graph connectivity K-edge-connected graph
303	172 Chapter 15 Dynamic Networks Many large-scale distributed systems and networks are dynamic. In some networks, e.g., peer-to-peer, nodes participate only for a short period of time, and Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Network flow Graph connectivity Bridge Flow network Connectivity Topology Push-relabel maximum flow algorithm Tango tree Graph theory Mathematics Combinatorics
304	C:/Documents and Settings/Arik Motskin/Desktop/CCCG/cds_cccg_paper.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:14 Network flow Dominating set Graph Flow network Connectivity Topology Tree decomposition Centrality Graph theory Mathematics Theoretical computer science
305	cccg-cluster_visibility-2.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 NP-complete problems Art gallery problem Steiner tree problem Vertex Connectivity Pseudotriangle Tree Graph Dominating set Graph theory Mathematics Theoretical computer science
306	Proceedings of IEEE conference on “Computer Vision and Pattern Recognition” (CVPR), 1998 p.648 Markov Random Fields with Efficient Approximations Yuri Boykov Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2004-09-12 22:08:02 Connectivity Dynamic programming Maximum flow problem Cut Mathematics Graph theory Applied mathematics
307	CCCG 2011, Toronto ON, August 10–12, 2011 Orthogonal Range Search using a Distributed Computing Model Pouya Bisadi∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Skip graph Distributed hash table Skip list Connectivity Linked list Node Chord Bin Koorde Distributed data storage Computing Computer programming
308	Less is More: Sampling the Neighborhood Graph Makes SALSA Better and Faster Marc Najork Sreenivas Gollapudi Add to Reading List Source URL: www.wsdm2009.org Language: English - Date: 2009-04-14 09:42:21 PageRank Vertex Distance Connectivity Graph theory Graph Neighbourhood
309	Tackling the Partner Units Configuration Problem∗ Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen Computing Laboratory University of Oxford Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:34:43 Graph operations Tree decomposition Connectivity Path decomposition Decomposition method Nondeterministic algorithm Connected component Tree Graph theory Theoretical computer science Mathematics

UPDATE